0.10/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.10/0.13 % Command : run_E %s %d THM 0.13/0.34 % Computer : n027.cluster.edu 0.13/0.34 % Model : x86_64 x86_64 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.13/0.34 % Memory : 8042.1875MB 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 0.13/0.34 % CPULimit : 960 0.13/0.34 % WCLimit : 120 0.13/0.34 % DateTime : Tue Aug 9 02:27:21 EDT 2022 0.13/0.35 % CPUTime : 0.20/0.47 Running higher-order on 8 cores theorem proving 0.20/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p 0.20/0.48 # Version: 3.0pre003-ho 0.20/0.48 eprover: Parsing a user given option argument: "(3.PNRefinedweight(PreferGoals,1,1,1,2,2,2,0.5),5.PNRefinedweight(PreferNonGoals,2,1,1,1,2,2,2),3.OrientLMaxWeight(PreferEasyHO,2,1,2,1,1),4.Diversityweight(DeferLambdas,1,1,1.5,1,1,-1.000000,0.000000,1.000000,1.000000)),1.FIFOWeight(ConstPrio),1.PNRefinedweight(PreferLambdas,2,1,1,1,2,2,2))":1:(Column 221):(just read ','): No token (probably EOF) expected, but Comma (',') read 0.20/0.48 eprover: Parsing a user given option argument: "(3.PNRefinedweight(PreferGoals,1,1,1,2,2,2,0.5),5.PNRefinedweight(PreferNonGoals,2,1,1,1,2,2,2),3.OrientLMaxWeight(PreferEasyHO,2,1,2,1,1),4.Diversityweight(DeferLambdas,1,1,1.5,1,1,-1.000000,0.000000,1.000000,1.000000)),1.FIFOWeight(ConstPrio),1.PNRefinedweight(PreferLambdas,2,1,1,1,2,2,2))":1:(Column 221):(just read ','): No token (probably EOF) expected, but Comma (',') read 0.20/0.48 eprover: Parsing a user given option argument: "(3.PNRefinedweight(PreferGoals,1,1,1,2,2,2,0.5),5.PNRefinedweight(PreferNonGoals,2,1,1,1,2,2,2),3.OrientLMaxWeight(PreferEasyHO,2,1,2,1,1),4.Diversityweight(DeferLambdas,1,1,1.5,1,1,-1.000000,0.000000,1.000000,1.000000)),1.FIFOWeight(ConstPrio),1.PNRefinedweight(PreferLambdas,2,1,1,1,2,2,2))":1:(Column 221):(just read ','): No token (probably EOF) expected, but Comma (',') read 0.20/0.48 eprover: Parsing a user given option argument: "(3.PNRefinedweight(PreferGoals,1,1,1,2,2,2,0.5),5.PNRefinedweight(PreferNonGoals,2,1,1,1,2,2,2),3.OrientLMaxWeight(PreferEasyHO,2,1,2,1,1),4.Diversityweight(DeferLambdas,1,1,1.5,1,1,-1.000000,0.000000,1.000000,1.000000)),1.FIFOWeight(ConstPrio),1.PNRefinedweight(PreferLambdas,2,1,1,1,2,2,2))":1:(Column 221):(just read ','): No token (probably EOF) expected, but Comma (',') read 0.20/0.49 # Preprocessing class: HSSSSMSSSSMNHHA. 0.20/0.49 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.49 # Starting post_as_ho5 with 600s (5) cores 0.20/0.49 # Starting sh2lt with 120s (1) cores 0.20/0.49 # Starting ehoh_best8_lambda with 120s (1) cores 0.20/0.49 # Starting post_as_ho10 with 120s (1) cores 0.20/0.49 # post_as_ho5 with pid 13180 completed with status 0 0.20/0.49 # Result found by post_as_ho5 0.20/0.49 # Preprocessing class: HSSSSMSSSSMNHHA. 0.20/0.49 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.49 # Starting post_as_ho5 with 600s (5) cores 0.20/0.49 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true) 0.20/0.49 # ...ProofStateSinE()=1/1 0.20/0.49 # Search class: HGUNF-FFSF00-SHHFFMBN 0.20/0.49 # Scheduled 6 strats onto 5 cores with 600 seconds (600 total) 0.20/0.49 # Starting ehoh_best6_lambda with 325s (1) cores 0.20/0.49 # Starting post_as_ho5 with 61s (1) cores 0.20/0.49 # Starting ehoh_best_nonlift_nonlambdatoforall with 55s (1) cores 0.20/0.49 # Starting sh2lt with 55s (1) cores 0.20/0.49 # Starting sh2l with 55s (1) cores 0.20/0.49 # ehoh_best6_lambda with pid 13184 completed with status 3 0.20/0.49 # Starting ehoh_best_sine with 49s (1) cores 0.20/0.49 # sh2l with pid 13190 completed with status 0 0.20/0.49 # Result found by sh2l 0.20/0.49 # Preprocessing class: HSSSSMSSSSMNHHA. 0.20/0.49 # Scheduled 4 strats onto 8 cores with 120 seconds (960 total) 0.20/0.49 # Starting post_as_ho5 with 600s (5) cores 0.20/0.49 # SinE strategy is GSinE(CountFormulas,,true,1.0,0,2,20000,1.0,true) 0.20/0.49 # ...ProofStateSinE()=1/1 0.20/0.49 # Search class: HGUNF-FFSF00-SHHFFMBN 0.20/0.49 # Scheduled 6 strats onto 5 cores with 600 seconds (600 total) 0.20/0.49 # Starting ehoh_best6_lambda with 325s (1) cores 0.20/0.49 # Starting post_as_ho5 with 61s (1) cores 0.20/0.49 # Starting ehoh_best_nonlift_nonlambdatoforall with 55s (1) cores 0.20/0.49 # Starting sh2lt with 55s (1) cores 0.20/0.49 # Starting sh2l with 55s (1) cores 0.20/0.49 # Preprocessing time : 0.001 s 0.20/0.49 # Presaturation interreduction done 0.20/0.49 0.20/0.49 # Proof found! 0.20/0.49 # SZS status Theorem 0.20/0.49 # SZS output start CNFRefutation 0.20/0.49 thf(decl_22, type, epred1_1: (($i > $o) > ($i > $o) > $o) > $i > $o). 0.20/0.49 thf(decl_23, type, epred2_1: (($i > $o) > ($i > $o) > $o) > $i > $o). 0.20/0.49 thf(decl_24, type, epred3_1: (($i > $o) > ($i > $o) > $o) > $i > $o). 0.20/0.49 thf(decl_25, type, epred4_1: (($i > $o) > ($i > $o) > $o) > $i > $o). 0.20/0.49 thf(decl_26, type, esk1_0: $i). 0.20/0.49 thf(decl_27, type, esk2_0: $i). 0.20/0.49 thf(decl_28, type, esk3_0: $i). 0.20/0.49 thf(cTHM120_3_pme, conjecture, (?[X1:($i > $o) > ($i > $o) > $o]:(((~((X1 @ (^[X2:$i]:(($true))) @ (^[X2:$i]:(~($true)))))&![X3:$i > $o, X4:$i > $o, X5:$i > $o]:((((X1 @ X4 @ X5)&(X1 @ X3 @ X4))=>(X1 @ X3 @ X5))))&![X6:$i > $o]:((X1 @ X6 @ X6))))&($true)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', cTHM120_3_pme)). 0.20/0.49 thf(c_0_1, negated_conjecture, ~(?[X1:($i > $o) > ($i > $o) > $o]:(((~(X1 @ (^[Z0:$i]:(($true))) @ (^[Z0:$i]:(~($true))))&![X3:$i > $o, X4:$i > $o, X5:$i > $o]:((((X1 @ X4 @ X5)&(X1 @ X3 @ X4))=>(X1 @ X3 @ X5))))&![X6:$i > $o]:((X1 @ X6 @ X6))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM120_3_pme])])])). 0.20/0.49 thf(c_0_2, negated_conjecture, ![X12:($i > $o) > ($i > $o) > $o]:(((((X12 @ (epred2_1 @ X12) @ (epred3_1 @ X12))|(X12 @ (^[Z0:$i]:(($true))) @ (^[Z0:$i]:(~($true))))|~(X12 @ (epred4_1 @ X12) @ (epred4_1 @ X12)))&((X12 @ (epred1_1 @ X12) @ (epred2_1 @ X12))|(X12 @ (^[Z0:$i]:(($true))) @ (^[Z0:$i]:(~($true))))|~(X12 @ (epred4_1 @ X12) @ (epred4_1 @ X12))))&(~(X12 @ (epred1_1 @ X12) @ (epred3_1 @ X12))|(X12 @ (^[Z0:$i]:(($true))) @ (^[Z0:$i]:(~($true))))|~(X12 @ (epred4_1 @ X12) @ (epred4_1 @ X12))))), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])). 0.20/0.49 thf(c_0_3, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((X1 @ (^[Z0:$i]:(($true))) @ (^[Z0:$i]:(((($true))!=(($true))))))|~((X1 @ (epred1_1 @ X1) @ (epred3_1 @ X1)))|~((X1 @ (epred4_1 @ X1) @ (epred4_1 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.49 thf(c_0_4, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((X1 @ (epred1_1 @ X1) @ (epred2_1 @ X1))|(X1 @ (^[Z0:$i]:(($true))) @ (^[Z0:$i]:(((($true))!=(($true))))))|~((X1 @ (epred4_1 @ X1) @ (epred4_1 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.49 thf(c_0_5, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((X1 @ (^[Z0:$i]:(($true))) @ (^[Z0:$i]:(~($true))))|~((X1 @ (epred1_1 @ X1) @ (epred3_1 @ X1)))|~((X1 @ (epred4_1 @ X1) @ (epred4_1 @ X1))))), inference(cn,[status(thm)],[c_0_3])). 0.20/0.49 thf(c_0_6, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((X1 @ (epred1_1 @ X1) @ (epred2_1 @ X1))|(X1 @ (^[Z0:$i]:(($true))) @ (^[Z0:$i]:(~($true))))|~((X1 @ (epred4_1 @ X1) @ (epred4_1 @ X1))))), inference(cn,[status(thm)],[c_0_4])). 0.20/0.49 thf(c_0_7, negated_conjecture, (((^[Z0:$i]:(~($true)))=(^[Z0:$i]:(($true))))|((epred1_1 @ $eq)!=(epred3_1 @ $eq))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]), c_0_5])). 0.20/0.49 thf(c_0_8, negated_conjecture, (((epred1_1 @ $eq)=(epred2_1 @ $eq))|((^[Z0:$i]:(~($true)))=(^[Z0:$i]:(($true))))), inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]), c_0_6])). 0.20/0.49 thf(c_0_9, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((X1 @ (epred2_1 @ X1) @ (epred3_1 @ X1))|(X1 @ (^[Z0:$i]:(($true))) @ (^[Z0:$i]:(((($true))!=(($true))))))|~((X1 @ (epred4_1 @ X1) @ (epred4_1 @ X1))))), inference(split_conjunct,[status(thm)],[c_0_2])). 0.20/0.49 thf(c_0_10, negated_conjecture, ((epred1_1 @ $eq)!=(epred3_1 @ $eq)), inference(cn,[status(thm)],[inference(arg_cong,[status(thm)],[c_0_7])])). 0.20/0.49 thf(c_0_11, negated_conjecture, ((epred1_1 @ $eq)=(epred2_1 @ $eq)), inference(cn,[status(thm)],[inference(arg_cong,[status(thm)],[c_0_8])])). 0.20/0.49 thf(c_0_12, negated_conjecture, ![X1:($i > $o) > ($i > $o) > $o]:(((X1 @ (epred2_1 @ X1) @ (epred3_1 @ X1))|(X1 @ (^[Z0:$i]:(($true))) @ (^[Z0:$i]:(~($true))))|~((X1 @ (epred4_1 @ X1) @ (epred4_1 @ X1))))), inference(cn,[status(thm)],[c_0_9])). 0.20/0.49 thf(c_0_13, negated_conjecture, ((epred3_1 @ $eq)!=(epred2_1 @ $eq)), inference(rw,[status(thm)],[c_0_10, c_0_11])). 0.20/0.49 thf(c_0_14, negated_conjecture, ((^[Z0:$i]:(~($true)))=(^[Z0:$i]:(($true)))), inference(sr,[status(thm)],[inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[inference(cn,[status(thm)],[])]), c_0_12]), c_0_13])). 0.20/0.49 thf(c_0_15, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(arg_cong,[status(thm)],[c_0_14])]), ['proof']). 0.20/0.49 # SZS output end CNFRefutation 0.20/0.49 # Parsed axioms : 1 0.20/0.49 # Removed by relevancy pruning/SinE : 0 0.20/0.49 # Initial clauses : 3 0.20/0.49 # Removed in clause preprocessing : 0 0.20/0.49 # Initial clauses in saturation : 3 0.20/0.49 # Processed clauses : 27 0.20/0.49 # ...of these trivial : 1 0.20/0.49 # ...subsumed : 2 0.20/0.49 # ...remaining for further processing : 24 0.20/0.49 # Other redundant clauses eliminated : 0 0.20/0.49 # Clauses deleted for lack of memory : 0 0.20/0.49 # Backward-subsumed : 1 0.20/0.49 # Backward-rewritten : 5 0.20/0.49 # Generated clauses : 56 0.20/0.49 # ...of the previous two non-redundant : 39 0.20/0.49 # ...aggressively subsumed : 0 0.20/0.49 # Contextual simplify-reflections : 0 0.20/0.49 # Paramodulations : 8 0.20/0.49 # Factorizations : 0 0.20/0.49 # NegExts : 3 0.20/0.49 # Equation resolutions : 0 0.20/0.49 # Propositional unsat checks : 0 0.20/0.49 # Propositional check models : 0 0.20/0.49 # Propositional check unsatisfiable : 0 0.20/0.49 # Propositional clauses : 0 0.20/0.49 # Propositional clauses after purity: 0 0.20/0.49 # Propositional unsat core size : 0 0.20/0.49 # Propositional preprocessing time : 0.000 0.20/0.49 # Propositional encoding time : 0.000 0.20/0.49 # Propositional solver time : 0.000 0.20/0.49 # Success case prop preproc time : 0.000 0.20/0.49 # Success case prop encoding time : 0.000 0.20/0.49 # Success case prop solver time : 0.000 0.20/0.49 # Current number of processed clauses : 12 0.20/0.49 # Positive orientable unit clauses : 2 0.20/0.49 # Positive unorientable unit clauses: 0 0.20/0.49 # Negative unit clauses : 1 0.20/0.49 # Non-unit-clauses : 9 0.20/0.49 # Current number of unprocessed clauses: 15 0.20/0.49 # ...number of literals in the above : 32 0.20/0.49 # Current number of archived formulas : 0 0.20/0.49 # Current number of archived clauses : 12 0.20/0.49 # Clause-clause subsumption calls (NU) : 10 0.20/0.49 # Rec. Clause-clause subsumption calls : 10 0.20/0.49 # Non-unit clause-clause subsumptions : 1 0.20/0.49 # Unit Clause-clause subsumption calls : 5 0.20/0.49 # Rewrite failures with RHS unbound : 0 0.20/0.49 # BW rewrite match attempts : 3 0.20/0.49 # BW rewrite match successes : 2 0.20/0.49 # Condensation attempts : 0 0.20/0.49 # Condensation successes : 0 0.20/0.49 # Termbank termtop insertions : 3739 0.20/0.49 0.20/0.49 # ------------------------------------------------- 0.20/0.49 # User time : 0.005 s 0.20/0.49 # System time : 0.004 s 0.20/0.49 # Total time : 0.010 s 0.20/0.49 # Maximum resident set size: 1840 pages 0.20/0.49 0.20/0.49 # ------------------------------------------------- 0.20/0.49 # User time : 0.023 s 0.20/0.49 # System time : 0.010 s 0.20/0.49 # Total time : 0.032 s 0.20/0.49 # Maximum resident set size: 1716 pages 0.20/0.49 EOF